A decomposition Algorithm for Solving Stochastic Multi-Level Large Scale Quadratic Programming Problem
نویسندگان
چکیده
We present a decomposition algorithm to solve a multi-level large scale quadratic programming problem with stochastic parameters in the objective functions. In the first phase of the solution algorithm and to avoid the complexity of this problem, the stochastic nature of the problem is converted into the equivalent crisp problem. In the second phase, Taylor series is combined with a decomposition algorithm to obtain the optimal solution for this problem. An illustrative example is discussed to demonstrate the correctness of the proposed solution method.
منابع مشابه
A New Compromise Decision-making Model based on TOPSIS and VIKOR for Solving Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty
This paper proposes a compromise model, based on a new method, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal ...
متن کاملA Compromise Decision-Making Model Based on TOPSIS and VIKOR for Multi-Objective Large- Scale Nonlinear Programming Problems with A Block Angular Structure under Fuzzy Environment
This paper proposes a compromise model, based on a new method, to solve the multiobjectivelarge scale linear programming (MOLSLP) problems with block angular structureinvolving fuzzy parameters. The problem involves fuzzy parameters in the objectivefunctions and constraints. In this compromise programming method, two concepts areconsidered simultaneously. First of them is that the optimal alter...
متن کاملOn Bi-Level Multi-Objective Large Scale Quadratic Programming Problem
This paper presents a bi level large scale multi objective quadratic programming problem (BLLSMOQPP) with fuzzy parameters in the objective functions problem. In the first phase convert the fuzzy parameters of the problem to equivalent crisp problem to make it easy in solving. In the second phase use Taylor series to convert the quadratic problem to linear problem to be easy for solving with th...
متن کاملBenders Decomposition Algorithm for Competitive Supply Chain Network Design under Risk of Disruption and Uncertainty
In this paper, bi-level programming is proposed for designing a competitive supply chain network. A two-stage stochastic programming approach has been developed for a multi-product supply chain comprising a capacitated supplier, several distribution centers, retailers and some resellers in the market. The proposed model considers demand’s uncertainty and disruption in distribution centers and t...
متن کاملA Compromise Decision-making Model for Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty
This paper proposes a compromise model, based on the technique for order preference through similarity ideal solution (TOPSIS) methodology, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. This compromise programming method is ba...
متن کامل